Descriptional complexity of two-way pushdown automata with restricted head reversals
نویسندگان
چکیده
منابع مشابه
Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals
Two-way nondeterministic pushdown automata (2PDA) are classical nondeterministic pushdown automata (PDA) enhanced with two-way motion of the input head. In this paper, the subclass of 2PDA accepting bounded languages and making at most a constant number of input head turns is studied with respect to descriptional complexity aspects. In particular, the effect of reducing the number of pushdown r...
متن کاملTwo-way finite automata with restricted nondeterminism and descriptional complexity
Acknowledgements : many thanks to professor Giovanni Pighizzini for its welcome and for having directed my internship. Many thanks also to Carlo Mereghetti and Beatrice Palano and all organizing committee of NCMA workshop for having given me the possibility to assist at this workshop. Many thanks also to Viliam Geffert for his contribution to our work. Thanks to Antonio Capoduro for coffees and...
متن کاملDescriptional complexity of unambiguous input-driven pushdown automata
It is known that a nondeterministic input-driven pushdown automaton (IDPDA) (a.k.a. visibly pushdown automaton; a.k.a. nested word automaton) of size n can be transformed to an equvalent deterministic automaton of size 2 2) (B. von Braunmühl, R. Verbeek, “Input-driven languages are recognized in log n space”, FCT 1983), and that this size is necessary in the worst case (R. Alur, P. Madhusudan, ...
متن کاملSimulation of Two-Way Pushdown Automata Revisited
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook’s in...
متن کاملDescriptional Complexity of Pushdown Store Languages
It is well known that the pushdown store language P (M) of a pushdown automaton (PDA) M — i.e., the language consisting of words occurring on the pushdown along accepting computations of M — is a regular language. Here, we design succinct nondeterministic finite automata (NFA) accepting P (M). In detail, an upper bound on the size of an NFA for P (M) is obtained, which is quadratic in the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.04.007